A graph search algorithm for indoor pursuit/evasion
نویسندگان
چکیده
منابع مشابه
A graph search algorithm for indoor pursuit/evasion
Using concepts from both robotics and graph theory, we formulate the problem of indoor pursuit/evasion in terms of searching the nodes of a graph for a mobile evader. We present the IGNS (Iterative Greedy Node Search) algorithm, which performs offline guaranteed search (i.e. no matter how the evader moves, it will eventually be captured). Furthermore, the algorithm produces an internal search (...
متن کاملA graph search algorithm: Optimal placement of passive harmonic filters in a power system
The harmonic in distribution systems becomes an important problem due to an increase in nonlinear loads. This paper presents a new approach based on a graph algorithm for optimum placement of passive harmonic filters in a multi-bus system, which suffers from harmonic current sources. The objective of this paper is to minimize the network loss, the cost of the filter and the total harmonic disto...
متن کاملA practical algorithm for [r, s, t]-coloring of graph
Coloring graphs is one of important and frequently used topics in diverse sciences. In the majority of the articles, it is intended to find a proper bound for vertex coloring, edge coloring or total coloring in the graph. Although it is important to find a proper algorithm for graph coloring, it is hard and time-consuming too. In this paper, a new algorithm for vertex coloring, edge coloring an...
متن کاملa graph search algorithm: optimal placement of passive harmonic filters in a power system
the harmonic in distribution systems becomes an important problem due to an increase in nonlinear loads. this paper presents a new approach based on a graph algorithm for optimum placement of passive harmonic filters in a multi-bus system, which suffers from harmonic current sources. the objective of this paper is to minimize the network loss, the cost of the filter and the total harmonic disto...
متن کاملA Search Algorithm for Clusters in a Network or Graph
A novel breadth-first based structural clustering method for graphs is proposed. Clustering is an important task for analyzing complex networks such as biological networks, World Wide Web and social networks. The clusters are of various shapes such as cliques and stars, for example, in ProteinProtein Interactive(PPI) networks. Traditional algorithms may detect clique-shaped clusters, but they f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 2009
ISSN: 0895-7177
DOI: 10.1016/j.mcm.2009.06.011